Parallel Algorithm for On-Line Ranking in Trees
نویسنده
چکیده
A node k-ranking of a graph G = (V, E) is a proper node coloring C: V {1, 2, ..., k} such that any x-y path in G with C(x) = C(y) contains an internal node z with C(z) C(x). In the on-line version of this problem, the nodes v1, v2,..., vn are coming one by one in an arbitrary order; and only the edges of the induced subgraph G[{v1, v2,..., vi}] are known when the color of vi has to be chosen. This paper gives an on-line ranking algorithm for general trees in parallel with O(nlogn) time using O(n/logn) processors on CREW PRAM model, and the cost is O(n).
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملA Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملAn On-Line Parallel Algorithm for Node Ranking of Trees
A node ranking of a graph G = (V,E) is a proper node coloring C : V → N such that any path in G with end nodes x, y fulfilling C(x) = C(y) contains an internal node z with C(z) > C(x). In the on-line version of the node ranking problem, the nodes v1, v2, ..., vn are coming one by one in an arbitrary order; and only the edges of the induced subgraph G[{v1, v2, ..., vi}] are known when the color ...
متن کاملAdaptive Line Enhancement Using a Parallel IIR Filter with A Step-By-step Algorithm
A step-by-step algorithm for enhancement of periodic signals that are highly corrupted by additive uncorrelated white gausian noise is proposed. In each adaptation step a new parallel second-order section is added to the previous filters. Every section has only one adjustable parameter, i.e., the center frequency of the self-tuning filter. The bandwidth and the convergence factor of each secti...
متن کاملOn-line Ranking Algorithms for Trees
A node k-ranking of a graph G = (V, E) is a proper node coloring C: V {1, 2, ..., k} such that any path in G with end nodes x, y fulfilling C(x) = C(y) contains an internal node z with C(z) C(x). In the on-line version of this problem, the nodes v1, v2,..., vn are coming one by one in an arbitrary order; and only the edges of the induced subgraph G[{v1, v2, ..., vi}] are known when the color...
متن کامل